MULTIPERIOD MULTI TRAVELING SALESMEN PROBLEM UNDER TIME WINDOW CONSTRAINTS
نویسندگان
چکیده
منابع مشابه
Two Time Window Discretization Methods for the Traveling Salesman Problem With Time Window Constraints
In this paper, we discuss the convergence of two time window discretization methods for the traveling salesman problem with time window constraints. These methods are general and can be applied to other vehicle routing and scheduling problems with time windows. The first method provides a feasible solution to the problem while the second provides a lower bound for the minimization problem. Anal...
متن کاملComparison Study of Multiple Traveling Salesmen Problem using Genetic Algorithm
Abstract: Multiple traveling salesman problems (MTSP) are a typical computationally complex combinatorial optimization problem, which is an extension of the famous traveling salesman problem (TSP). The MTSP can be generalized to a wide variety of routing and scheduling problems. The paper makes the attempt to show how Genetic Algorithm (GA) can be applied to the MTSP with ability constraint. In...
متن کاملA Market-based Solution to the Multiple Traveling Salesmen Problem
This paper describes a market-based solution to the problem of assigning mobile agents to tasks. The problem is formulated as the multiple depots, multiple traveling salesmen problem (MTSP), where agents and tasks operate in a market to achieve near-optimal solutions. We consider both the classical MTSP, in which the sum of all tour lengths is minimized, and the Min-Max MTSP, in which the longe...
متن کاملThe multiple traveling salesmen problem with moving targets
The multiple traveling salesmen problem with moving targets (MTSPMT) is a generalization of the classical traveling salesmen problem (TSP), where the targets (cities or objects) are moving over time. Additionally, for each target a visibility time window is given. The task is to find routes for several salesmen so that each target is reached exactly once within its visibility time window and th...
متن کاملTraveling salesmen in the presence of competition
We propose the “Competing Salesmen Problem” (CSP), a 2-player competitive version of the classical Traveling Salesman Problem. This problem arises when considering two competing salesmen instead of just one. The concern for a shortest tour is replaced by the necessity to reach any of the customers before the opponent does. In particular, we consider the situation where players take turns, movin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Anadolu University Journal of Science and Technology-A Applied Sciences and Engineering
سال: 2015
ISSN: 2146-0205,1302-3160
DOI: 10.18038/btd-a.72818